66 research outputs found
Online version of the theorem of Thue
A sequence S is nonrepetitive if no two adjacent blocks of S are the same. In
1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over
3 symbols. We consider the online variant of this result in which a
nonrepetitive sequence is constructed during a play between two players: Bob is
choosing a position in a sequence and Alice is inserting a symbol on that
position taken from a fixed set A. The goal of Bob is to force Alice to create
a repetition, and if he succeeds, then the game stops. The goal of Alice is
naturally to avoid that and thereby to construct a nonrepetitive sequence of
any given length. We prove that Alice has a strategy to play arbitrarily long
provided the size of the set A is at least 12. This is the online version of
the Theorem of Thue. The proof is based on nonrepetitive colorings of
outerplanar graphs. On the other hand, one can prove that even over 4 symbols
Alice has no chance to play for too long. The minimum size of the set of
symbols needed for the online version of Thue's theorem remains unknown
Majority choosability of digraphs
A \emph{majority coloring} of a digraph is a coloring of its vertices such
that for each vertex , at most half of the out-neighbors of has the same
color as . A digraph is \emph{majority -choosable} if for any
assignment of lists of colors of size to the vertices there is a majority
coloring of from these lists. We prove that every digraph is majority
-choosable. This gives a positive answer to a question posed recently by
Kreutzer, Oum, Seymour, van der Zypen, and Wood in \cite{Kreutzer}. We obtain
this result as a consequence of a more general theorem, in which majority
condition is profitably extended. For instance, the theorem implies also that
every digraph has a coloring from arbitrary lists of size three, in which at
most of the out-neighbors of any vertex share its color. This solves
another problem posed in \cite{Kreutzer}, and supports an intriguing conjecture
stating that every digraph is majority -colorable
Strong chromatic index of sparse graphs
A coloring of the edges of a graph is strong if each color class is an
induced matching of . The strong chromatic index of , denoted by
, is the least number of colors in a strong edge coloring
of . In this note we prove that for every -degenerate graph . This confirms the strong
version of conjecture stated recently by Chang and Narayanan [3]. Our approach
allows also to improve the upper bound from [3] for chordless graphs. We get
that for any chordless graph . Both
bounds remain valid for the list version of the strong edge coloring of these
graphs
- …